home
***
CD-ROM
|
disk
|
FTP
|
other
***
search
/
TPUG - Toronto PET Users Group
/
TPUG Users Group CD
/
TPUG Users Group CD.iso
/
COMAL
/
U-User Group
/
(k)u8.d64
/
about'disk
< prev
next >
Wrap
Text File
|
2007-02-28
|
8KB
|
273 lines
╒.╦. ├╧═┴╠ ╙.╔.╟. ─╔╙╦ 1
---------------------------------------
╘HIS IS THE FIRST ├╧═┴╠ APPLICATIONS
DISK FROM THE ╒╦ ├╧═┴╠ ╙PECIAL
╔NTEREST ╟ROUP. ╘HE PROGRAMS ON THIS
DISK HAVE BEEN PROVIDED BY ├╧═┴╠ USERS
AROUND THE WORLD FOR USE WITH ├╧═┴╠
VERSION 0.14 FOR THE ├OMMODORE 64.
╘HESE PROGRAMS MAY BE COPIED UNCHANGED
WITHOUT RESTRICTION. ╔F YOU CAN IMPROVE
ON THESE PROGRAMS OR PRODUCE SOME NEW
├╧═┴╠ APPLICATIONS PLEASE SHARE THEM
WITH THE ├╧═┴╠ COMMUNITY BY SENDING
THEM TO THE ╒╦ ├╧═┴╠ ╙╔╟.
┴LL APPLICATION PROGRAMS ON THIS DISK
WITH A FILENAME ENDING IN '.╠' SHOULD
BE LOADED INTO MEMORY BY USING THE
├╧═┴╠ ┼╬╘┼╥ COMMAND. ┴LL OTHER PROGRAMS
SHOULD BE LOADED USING THE ╠╧┴─ COMMAND.
╒SE OF THE FIRST 4 FILES ON THE DISK
HAS BEEN DESCRIBED IN THE LETTER
ACCOMPANYING THIS DISK. ╔ THANK ╟LEN
├OLBERT AND THE ├╧═┴╠ ╒SERS ╟ROUP ╒╙┴
╠TD. FOR THE METHOD OF PLACING THE
ERROR MESSAGES IN ╥┴═ WHICH WAS USED IN
THE PROGRAM ┼═.
---------
┼─╒├┴╘╔╧╬
---------
┴LL OF THE PROGRAMS IN THIS SECTION
HAVE BEEN PROVIDED BY ┬ERT ═ILLEST OF
THE ╒╦ ├╧═┴╠ ╙╔╟. ╘HE VARIOUS SORT
AND BINARY SEARCH PROCEDURES HAVE COME
FROM ╥OY ┴THERTON'S BOOK '╙TRUCTURED
╨ROGRAMMING WITH ├╧═┴╠'. ┴ GREAT DEAL
OF EFFORT HAS GONE INTO PROGRAMMING
THESE DEMOS. ╔MAGINATIVE USE OF COLOUR
AND MOVEMENT HAS BEEN MADE TO ENHANCE
THE DEMOS.
─┼═╧'╙┼╠┼├╘'╙╧╥╘ IS A DEMONSTRATION TO
SHOW HOW THE SELECTION SORT PROCESS
OPERATES. ┘OU ARE ADVISED TO HAVE A
PRINTOUT OF ╙┼╠┼├╘╔╧╬'╙╧╥╘.╠ FOR REVIEW
WHILE THE DEMONSTRATION PROCEEDS.
╙┼╠┼├╘╔╧╬'╙╧╥╘.╠ IS THE SORT PROCEDURE
USED IN THE ABOVE DEMO AND CAN BE USED
IN YOUR OWN PROGRAMS.
─┼═╧'┬╒┬┬╠┼╙╧╥╘ IS A DEMONSTRATION TO
SHOW HOW THE BUBBLE SORT PROCESS
OPERATES. ┘OU ARE ADVISED TO HAVE A
PRINTOUT OF ┬╒┬┬╠┼╙╧╥╘.╠ FOR REVIEW
WHILE THE DEMONSTRATION PROCEEDS.
┬╒┬┬╠┼╙╧╥╘.╠ IS THE SORT PROCEDURE
USED IN THE ABOVE DEMO AND CAN BE USED
IN YOUR OWN PROGRAMS.
─┼═╧'╔╬╙┼╥╘'╙╧╥╘ IS A DEMONSTRATION TO
SHOW HOW THE INSERT SORT PROCESS
OPERATES. ┘OU ARE ADVISED TO HAVE A
PRINTOUT OF ╔╬╙┼╥╘╔╧╬'╙╧╥╘.╠ FOR REVIEW
WHILE THE DEMONSTRATION PROCEEDS.
╔╬╙┼╥╘╔╧╬'╙╧╥╘.╠ IS THE SORT PROCEDURE
USED IN THE ABOVE DEMO AND CAN BE USED
IN YOUR OWN PROGRAMS.
╔╬╘╥╧─'╤╒╔├╦╙╧╥╘ WHICH SHOULD BE RUN
BEFORE THE NEXT PROGRAM GIVES A LINE BY
LINE RUNDOWN OF HOW THE QUICKSORT
PROCESS OPERATES.
─┼═╧'╤╒╔├╦╙╧╥╘ IS A DEMONSTRATION TO
SHOW HOW THE QUICKSORT PROCESS
OPERATES. ┘OU ARE ADVISED TO HAVE A
PRINTOUT OF ╤╒╔├╦╙╧╥╘'╓┼╥╘.╠ FOR REVIEW
WHILE THE DEMONSTRATION PROCEEDS.
╤╒╔├╦╙╧╥╘╓┼╥╘.╠ IS THE SORT PROCEDURE
USED IN THE ABOVE DEMO AND CAN BE USED
IN YOUR OWN PROGRAMS.
╙╧╥╘'╘╔═┼╥'╨╥╟ IS USED TO DEMONSTRATE
HOW THE VARIOUS SORT PROCESSES COMPARE
IN EXECUTION TIME. ┘OU ARE ADVISED TO
RUN THE PROGRAM WITH VARIOUS VALUES OF
NUMBER OF ITEMS TO SORT. ┘OU SHOULD
SEE THAT THE CHOICE OF SORT PROCESS TO
USE MAY VARY WITH NUMBER OF ITEMS TO
SORT. ╨LEASE NOTE THAT IT TAKES ABOUT
20 MINUTES TO SORT A 200 ITEM LIST WITH
┬UBBLESORT SO WITH SUCH VALUES BE
PREPARED TO DRINK A CUP OF COFFEE WHILE
WAITING FOR THE PROGRAM TO RUN!
╥╬─'╬┴═┼$'1000 IS A DATA FILE USED IN
ABOVE DEMONSTRATION.
─┼═╧'┬╔╬'╙┼┴╥├╚ IS A DEMONSTRATION TO
SHOW HOW THE BINARY SEARCH PROCESS
OPERATES. ┘OU ARE ADVISED TO HAVE A
PRINTOUT OF ┬╔╬┴╥┘'╙┼┴╥├╚ FOR REVIEW
WHILE THE DEMONSTRATION PROCEEDS.
┬╔╬┴╥┘'╙┼┴╥├╚ IS THE SEARCH PROCEDURE
USED IN THE ABOVE DEMO.
╞╧╥'╠╧╧╨'╨┴╥╘'1 IS A DEMONSTRATION
PROGRAM TO SHOW HOW SIMPLE ╞╧╥ LOOPS
WORK IN ├╧═┴╠.
╞╧╥'╠╧╧╨'╨┴╥╘'2 IS A DEMONSTRATION
PROGRAM TO SHOW HOW MORE COMPLEX ╞╧╥
LOOPS WORK IN ├╧═┴╠.
---------
╒╘╔╠╔╘╔┼╙
---------
─╒═╨'┼╨╙╧╬ HAS BEEN PROVIDED BY ╫ALLACE
╠OUIE OF THE ╒╙┴ ├╧═┴╠ ╒SERS ╟ROUP ╠TD.
╔T IS USED TO DUMP A ├╧═┴╠ HIRES SCREEN
DISPLAY TO AN ┼PSON PRINTER. ╘O USE
THIS FACILITY YOU MUST NOT HAVE ERROR
MESSAGES IN ╥┴═ AS THEY WILL BE
OVERWRITTEN BY THE DUMP MACHINE CODE.
╘O LOAD THIS MACHINE CODE INTO THE
APPROPRIATE PLACE IN MEMORY JUST
LOAD AND RUN ╠╧┴─'─╒═╨'┼╨╙╧╬. ╘HIS WILL
READ AND LOCATE ─╒═╨'┼╨╙╧╬. ╫HEN YOU
WISH TO DO A DUMP TO PRINTER OF THE
HIRES SCREEN SIMPLY TYPE ╙┘╙ 49152.
─╒═╨'═╨╙801 HAS BEEN PROVIDED BY ┼RIC
╟IGUERRE OF THE ╒╙┴ ├╧═┴╠ ╒SERS ╟ROUP
╠TD. ╔T WILL DUMP A ├╧═┴╠ HIRES SCREEN
DISPLAY TO A ├OMMODORE ═╨╙801 PRINTER.
╨LEASE NOTE THAT EACH EIGHTH BIT IS
LOST BUT AS THIS IS THE ONLY DUMP
ROUTINE ╔ HAVE FOUND FOR THE ═╨╙801 ╔
FELT IT WORTHWHILE TO INCLUDE IT.
╒╨╠╧╘╙.╠ IS A SET OF ROUTINES PROVIDED
BY ╨ETER ╙MITH OF THE ╒╦ ├╧═┴╠ ╙╔╟.
╥OUTINES TO PLOT OR ERASE CIRCLES, ARCS
OR LINES AS WELL AS AN UNPLOT ROUTINE
ARE PROVIDED. ╘URNING OFF THE VISIBLE
╘URTLE WILL IMPROVE THE SPEED OF THESE
ROUTINES.
╘╚╥┼┼'─.╠ IS A ROUTINE PROVIDE BY ╨ETER
╙MITH OF THE ╒╦ ├╧═┴╠ ╙╔╟. ╔T WILL
SIMULATE THE PLOTTING OF CO-ORDINATES
IN THREE DIMENSIONAL SPACE ON THE HIRES
SCREEN. ┴ DEMONSTRATION IS PROVIDED
WITH THE ROUTINE.
╟┼╧═┼╘╥┘.╠ IS PROVIDED BY ┬ILL ╨ODMORE
OF THE ╒╦ ├╧═┴╠ ╙╔╟. ╘HREE ROUTINES
ARE PROVIDED. ╧NE TO DETERMINE THE
PERPENDICULAR DISTANCE FROM A POINT TO
A STRAIGHT LINE. ┴NOTHER TO DETERMINE
THE POINTS OF INTERSECTION OF TWO
CIRCLES. ╘HE LAST ROUTINE FINDS THE
POINT OF INTERSECTION OF TWO LINES.
--------
─┴╘┴┬┴╙┼
--------
┬OTH THESE PROGRAMS ARE RELATIVELY
SIMPLE AND NEED MUCH IMPROVEMENT TO
FORM A COMPLETE DATABASE SYSTEM WITH
ALL THE USUAL FACILITIES. ╘HEY HAVE,
NEVERTHELESS, BEEN USED BY THEIR
AUTHORS IN A PRACTICAL APPLICATION.
╞╔╠╔╬╟ IS A PROGRAM FROM ┬ERT ═ILLEST
OF THE ╒╦ ├╧═┴╠ ╙╔╟ TO STORE AND
MAINTAIN A LIBRARY OF SEQUENTIAL FILES.
┼ACH FILE CAN HOLD UP TO 50 LINES OF
INFORMATION. ╔NFORMATION IS CREATED AND
AMENDED BY SPECIFYING THE FILE BY INDEX
NUMBER AND LINE BY LINE NUMBER.
╥OUTINES EXIST TO CREATE AND AMEND
INDIVIDUAL INFORMATION LINES AND
DISPLAY AND PRINT COMPLETE FILES.
╘HE PROGRAM WORKS BY READING THE FILE
TO BE WORKED ON INTO MEMORY, DOING ALL
AMENDMENT IN MEMORY AND THEN WRITING
THE REVISED FILE TO DISK. ╔F THINGS DO
NOT WORK AS EXPECTED THEN CONSIDER THIS
POINT AS IT IS PROBABLY THE REASON FOR
YOUR ERROR.
1541 ─┴╘┴┬┴╙┼ IS PROVIDED BY ═ARTIN
╩OHNSON OF THE ╒╦ ├╧═┴╠ ╙╔╟. ╘HIS IS
MORE LIKE A TRUE DATABASE FILING SYSTEM
WHICH USES RELATIVE FILES TO STORE
INFORMATION. ╥OUTINES EXIST TO CREATE,
MODIFY AND DISPLAY INDIVIDUAL RECORDS
OF INFORMATION FROM THE RELATIVE FILE.
╘HIS PROGRAM COULD BE MADE MORE USEFUL
BY ADDING ROUTINES TO SORT AND PRINT
SELECTED RECORDS. ╟O TO IT ALL YOU
├╧═┴╠ ENTHUSIASTS!
-----------
┼╬╟╔╬┼┼╥╔╬╟
-----------
╙┼├╘╔╧╬ IS A PROGRAM PROVIDED BY ┬ILL
╨ODMORE OF THE ╒╦ ├╧═┴╠ ╙╔╟. ┴ SECTION
IS DEFINED BY CO-ORDINATES OF THE
CORNERS. ╘HE EDGES OF THE SECTION ARE
ASSUMED TO BE STRAIGHT LINES BETWEEN
THE CORNERS SO CURVED SECTIONS HAVE TO
BE APPROXIMATED. ╘HE PROGRAM WILL
CALCULATE THE AREA, CENTRE OF GRAVITY
AND SECOND ORDER MOMENTS OF THE
SECTION.
╥┼╠╔┴┬╔╠╔╘┘ IS A PROGRAM PROVIDED BY
MYSELF, ┬RIAN ╟RAINGER, OF THE
╒╦ ├╧═┴╠ ╙╔╟. ╔T CAN BE USED BY
╥ELIABILITY ┼NGINEERS TO CALCULATE THE
╥ELIABILITY OF COMPLEX EQUIPMENT WHICH
INCLUDES COMBINATIONS OF ELEMENTS IN
SERIES, ACTIVE REDUNDANCY, STANDBY
REDUNDANCY AND BINOMIAL ACTIVE OR
STANDBY REDUNDANCY. ═ORE COMPLEX MODELS
CAN BE DEFINED BY THE GIVING THE
RELIABILITY AT TWO TIME POINTS AND A
╫EIBULL FIT WILL BE ASSUMED.
┼LEVEN TIME POINTS ARE GIVEN IN THE
PROGRAM FOR CALCULATIONS. ╘HEY MAY BE
ALTERED BY MODIFYING THE PROGRAM.
╔NPUT CONSISTS OF DEFINING THE
INDIVIDUAL RELIABILITY MODELS AND THE
RELIABILITY DATA OF THE ELEMENTS OF THE
MODEL. ┴S EACH MODEL IS GIVEN THE
RELIABILITY AT THE VARIOUS TIME POINTS
IS CALCULATED AND DISPLAYED. ╫HEN ALL
MODELS HAVE BEEN INPUT THE SYSTEM
RELIABILITY, ASSUMING ALL THE MODEL
ELEMENTS ARE IN SERIES, IS CALCULATED
AND DISPLAYED.
---------------------------------------
┴NY COMMENTS OR ADDITIONS TO THIS DISK
SHOULD BE SENT TO:
┬RIAN ╟RAINGER,
╒╦ ├╧═┴╠ ╙╔╟,
╔├╨╒╟,
73, ═INEHEAD ╫AY,
╙TEVENAGE,
╚ERTFORDSHIRE
╙╟1 2╚┌
┼NGLAND
╘EL. +44 438 727925
╨RESTEL ═AILBOX 438727925
3RD ╞EBRUARY 1985